A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs
نویسندگان
چکیده
Binary decision diagrams have been shown as a powerful paradigm in handling Boolean functions and have been applied to many fields such as VLSI CAD, AI, combinatorics, etc. This paper proposes a new operation on an ordered binary decision diagram (OBDD), called reordering, and demonstrates its usefulness with presenting an extended algorithmic framework of applying OBDDs to combinatorial graph enu-
منابع مشابه
An Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملOrdered Binary Decision Diagrams, Graph Theory and Computational Geometry AUTHORS
Ordered binary decision diagrams (OBDDs in short) have been shown as a powerful paradigm in handling Boolean functions and have been applied to many elds such as VLSI CAD, AI, combinatorics, etc. In this paper, we consider Boolean functions representing some concepts in graph theory such as spanning trees, matchings, cliques, etc., as well as concepts in computational geometry such as planar tr...
متن کاملApplication Driven Variable Reordering and an Example Implementation in Reachability Analysis
Variable reordering is the main approach to minimize the size of Ordered Binary Decision Diagrams. But despite the huge effort spent, up to now, to design different reordering heuristics, their performance often does not meet the needs of the applications. In many OBDD-based computations, the time cost for reordering dominates the time spent by the computa-
متن کاملGenetic Algorithm for Ordered Decision Diagrams Optimization
In this paper we present an approach for the optimization of ordered Binary Decision Diagrams (OBDDs), based on Genetic Algorithms. In this method we consider completely specified Boolen Functions (BFs). The method uses specific reordering heuristics [3] and combines them with principles of genetic algorithms in order to determine a good variable ordering. Only small populations are considered ...
متن کاملComplexity of Problems on Graphs Represented as OBDDs (Extended Abstract)
To analyze the complexity of decision problems on graphs, one normally assumes that the input size is polynomial in the number of vertices. Galperin and Wigderson [GW83] and, later, Papadimitriou and Yannakakis [PY86] investigated the complexity of these problems when the input graph is represented by a polylogarithmically succinct circuit. They showed that, under such a representation, certain...
متن کامل